393 research outputs found

    Paper about Dr. William Aaron Brandenburg.

    Get PDF
    10 page paper for a class; about W. A. Brandenbur

    Multiple Object Tracking in Urban Traffic Scenes with a Multiclass Object Detector

    Full text link
    Multiple object tracking (MOT) in urban traffic aims to produce the trajectories of the different road users that move across the field of view with different directions and speeds and that can have varying appearances and sizes. Occlusions and interactions among the different objects are expected and common due to the nature of urban road traffic. In this work, a tracking framework employing classification label information from a deep learning detection approach is used for associating the different objects, in addition to object position and appearances. We want to investigate the performance of a modern multiclass object detector for the MOT task in traffic scenes. Results show that the object labels improve tracking performance, but that the output of object detectors are not always reliable.Comment: 13th International Symposium on Visual Computing (ISVC

    Simple Baselines for Human Pose Estimation and Tracking

    Full text link
    There has been significant progress on pose estimation and increasing interests on pose tracking in recent years. At the same time, the overall algorithm and system complexity increases as well, making the algorithm analysis and comparison more difficult. This work provides simple and effective baseline methods. They are helpful for inspiring and evaluating new ideas for the field. State-of-the-art results are achieved on challenging benchmarks. The code will be available at https://github.com/leoxiaobin/pose.pytorch.Comment: Accepted by ECCV 201

    Localization Recall Precision (LRP): A New Performance Metric for Object Detection

    Get PDF
    Average precision (AP), the area under the recall-precision (RP) curve, is the standard performance measure for object detection. Despite its wide acceptance, it has a number of shortcomings, the most important of which are (i) the inability to distinguish very different RP curves, and (ii) the lack of directly measuring bounding box localization accuracy. In this paper, we propose 'Localization Recall Precision (LRP) Error', a new metric which we specifically designed for object detection. LRP Error is composed of three components related to localization, false negative (FN) rate and false positive (FP) rate. Based on LRP, we introduce the 'Optimal LRP', the minimum achievable LRP error representing the best achievable configuration of the detector in terms of recall-precision and the tightness of the boxes. In contrast to AP, which considers precisions over the entire recall domain, Optimal LRP determines the 'best' confidence score threshold for a class, which balances the trade-off between localization and recall-precision. In our experiments, we show that, for state-of-the-art object (SOTA) detectors, Optimal LRP provides richer and more discriminative information than AP. We also demonstrate that the best confidence score thresholds vary significantly among classes and detectors. Moreover, we present LRP results of a simple online video object detector which uses a SOTA still image object detector and show that the class-specific optimized thresholds increase the accuracy against the common approach of using a general threshold for all classes. At https://github.com/cancam/LRP we provide the source code that can compute LRP for the PASCAL VOC and MSCOCO datasets. Our source code can easily be adapted to other datasets as well.Comment: to appear in ECCV 201

    THERMAL CONDUCTIVITY FOR A NOISY DISORDERED HARMONIC CHAIN

    Get PDF
    We consider a dd-dimensional disordered harmonic chain (DHC) perturbed by an energy conservative noise. We obtain uniform in the volume upper and lower bounds for the thermal conductivity defined through the Green-Kubo formula. These bounds indicate a positive finite conductivity. We prove also that the infinite volume homogenized Green-Kubo formula converges

    The postprocessing resolution required for accurate RF coverage validation and prediction

    Full text link

    t1/3t^{1/3} Superdiffusivity of Finite-Range Asymmetric Exclusion Processes on Z\mathbb Z

    Full text link
    We consider finite-range asymmetric exclusion processes on Z\mathbb Z with non-zero drift. The diffusivity D(t)D(t) is expected to be of O(t1/3){\mathcal O}(t^{1/3}). We prove that D(t)Ct1/3D(t)\ge Ct^{1/3} in the weak (Tauberian) sense that 0eλttD(t)dtCλ7/3\int_0^\infty e^{-\lambda t}tD(t)dt \ge C\lambda^{-7/3} as λ0\lambda\to 0. The proof employs the resolvent method to make a direct comparison with the totally asymmetric simple exclusion process, for which the result is a consequence of the scaling limit for the two-point function recently obtained by Ferrari and Spohn. In the nearest neighbor case, we show further that tD(t)tD(t) is monotone, and hence we can conclude that D(t)Ct1/3(logt)7/3D(t)\ge Ct^{1/3}(\log t)^{-7/3} in the usual sense.Comment: Version 3. Statement of Theorem 3 is correcte
    corecore